Growth of the perfect sequence covering array number

نویسندگان

چکیده

Abstract In this note we answer positively an open question posed by Yuster in 2020 [14] on the polynomial boundedness of perfect sequence covering array number $$g(n,k)$$ g ( n , k ) (PSCA number). The latter determines (renormalized) minimum row-count that arrays (PSCAs) can possess. PSCAs are matrices with permutations $$S_n$$ S as rows, such each ordered k -sequence distinct elements $$[n]$$ [ ] is covered same rows. We obtain result after illuminating isomorphism between structure from design theory and a special case min-wise independent permutations. Afterwards, point out asymptotic bounds constructions be transferred these two structures. Moreover, sharpen lower for g ( n , ) improve upper 4) 3), some concrete values . conclude questions propose new matrix class being potentially advantageous searching PSCAs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ON THE NUMBER OF BLOCKS IN A PERFECT COVERING OF v POINTS

A perfect covering of a v-set X is a set of subsets of X (called blocks), such that every pair of elements of X (points) occurs in a unique block. A perfect covering is also referred to in the literature as a pairwise balanced design or a finite linear space. The quantity of g’“‘(v) is defined to be the minimum number of blocks in a perfect covering of a v-set, in which the longest block has si...

متن کامل

New Covering Array Numbers

A covering array CA(N ; t, k, v) is anN×k array on v symbols such that everyN×t subarray contains as a row each t-tuple over the v symbols at least once. The minimum N for which a CA(N ; t, k, v) exists is called the covering array number of t, k, and v, and it is denoted by CAN(t, k, v). In this work we prove that if exists CA(N ; t+ 1, k + 1, v) it can be obtained from the juxtaposition of v ...

متن کامل

an investigation about the relationship between insurance lines and economic growth; the case study of iran

مطالعات قبلی بازار بیمه را به صورت کلی در نظر می گرفتند اما در این مطالعه صنعت بیمه به عنوان متغیر مستفل به بیمه های زندگی و غیر زندگی شکسته شده و هم چنین بیمه های زندگی به رشته های مختلف بیمه ای که در بازار بیمه ایران سهم قابل توجهی دارند تقسیم میشود. با استفاده از روشهای اقتصاد سنجی داده های برای دوره های 48-89 از مراکز ملی داده جمع آوری شد سپس با تخمین مدل خود بازگشتی برداری همراه با تعدادی ...

15 صفحه اول

An Exact Approach to Maximize the Number of Wild Cards in a Covering Array

Covering Arrays CA(N ; t, k, v) are combinatorial structures that can be used to define adequate test suites for software testing. The smaller a CA is, the smaller the number of test cases that will be given to test the functionality of a software component in order to identify possible failures. Due to the fact that the construction of CAs of optimal size is a highly combinatorial problem, sev...

متن کامل

Ternary Hamming and binary perfect covering codes

Given 1 1n € Z, the n-cube Q, is the graph with vertex set V : {0, l}' and ed"geset n:VT:orfi, where f' : {(r,w) e V xV: (u _ w)i:1if and only if j: i,(j:0,.'. ,n-l)), for i:0,... ,n-1. The edges of/t aresaidtohave (ortolie along) the directioni,for i 0,.. . ,n-!.Given a graph G, we say that S gVG) is a perfect dom'inating sei (or PDS) of G if every u € V(G) \ S is neighbor of exactly one verte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Designs, Codes and Cryptography

سال: 2022

ISSN: ['0925-1022', '1573-7586']

DOI: https://doi.org/10.1007/s10623-022-01168-3